Orbifold equivalence: structure and new examples

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orbifold equivalence and the sign problem at finite baryon density.

We point out that SO(2N(c)) gauge theory with N(f) fundamental Dirac fermions does not have a sign problem at finite baryon number chemical potential μ(B). One can thus use lattice Monte Carlo simulations to study this theory at finite density. The absence of a sign problem in the SO(2N(c)) theory is particularly interesting because a wide class of observables in the SO(2N(c)) theory coincide w...

متن کامل

Artificial Examples of Empirical Equivalence

In this paper I analyze three artificial examples of empirical equivalence: van Fraassen‟s alternative formulations of Newton‟s theory, the Poincaré-Reichenbach argument for the conventionality of geometry; and predictively equivalent „systems of the world‟. These examples have received attention in the philosophy of science literature because they are supposed to illustrate the connection betw...

متن کامل

Corings. Examples and Structure

This talk will consist of an overview on recent developments that reveal striking connections between the theory of corings and some aspects of the algebraic approach to Non Commutative Geometry, including Descent Theory, Galois Extensions, Differential Calculi or (quantum) Principal Bundles. Some results on the structure of the category of comodules over a coring will be discussed.

متن کامل

New examples of damped wave equations with gradient-like structure

This article shows how to use perturbation methods to get new examples of evolutionary partial differential equations with gradient-like structure. In particular, we investigate the case of the wave equation with a variable damping satisfying the geometric control condition only, and the case of the wave equation with a damping of indefinite sign.

متن کامل

Testing Strong Equivalence of Datalog Programs - Implementation and Examples

In this work strong equivalence of disjunctive first order datalog programs under the stable model semantic is considered. The problem is reduced to the unsatisfiability problem of Bernays-Schönfinkel formulas. An implementation is described in detail.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Singularities

سال: 2018

ISSN: 1949-2006

DOI: 10.5427/jsing.2018.17j